Two remarks on amalgams of locally finite groups
نویسندگان
چکیده
منابع مشابه
Algorithmic Problems in Amalgams of Finite Groups
Geometric methods proposed by Stallings [53] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [4, 25, 37, 38, 43, 48, 56]. It turns out that Stallings’ methods can be effectively generalized for the class of amalgams of finite groups [39]. In the present paper we employ subgroup gr...
متن کاملAmalgams of Nilpotent Groups of Class Two
In this paper we will prove analogues of B. Maier’s characterization of weak and strong embeddability of amalgams in N2 [12, 13] for the subvarieties of N2. We will also give analogues of D. Saracino’s characterization of weak and strong amalgamation bases [17], the author’s work on dominions [11] and on amalgamation bases in some varieties of nil-2 groups [8, 9]. Definitions will be recalled b...
متن کاملSome numerical results on two classes of finite groups
In this paper, we consider the finitely presented groups $G_{m}$ and $K(s,l)$ as follows;$$G_{m}=langle a,b| a^m=b^m=1,~[a,b]^a=[a,b],~[a,b]^b=[a,b]rangle $$$$K(s,l)=langle a,b|ab^s=b^la,~ba^s=a^lbrangle;$$and find the $n^{th}$-commutativity degree for each of them. Also we study the concept of $n$-abelianity on these groups, where $m,n,s$ and $l$ are positive integers, $m,ngeq 2$ and $g.c.d(s,...
متن کاملAlgorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection
Geometric methods proposed by Stallings [46] for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups [3, 19, 29, 30, 36, 41, 49]. In the present paper we employ the generalized Stallings’ methods, developed by the author in [32], to solve various algorithmic problems concerning finitely g...
متن کاملStallings Foldings and Subgroups of Amalgams of Finite Groups
In the 1980’s Stallings [35] showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse automaton. This allows for the deep algorithmic theory of finite automata and finite inverse monoids to be used to answer questions about finitely generate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1987
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700003750